Efficient Discretization‐Independent Bayesian Inversion of High‐Dimensional Multi‐Gaussian Priors Using a Hybrid MCMC
نویسندگان
چکیده
In geostatistics, Gaussian random fields are often used to model heterogeneities of soil or subsurface parameters. To give spatial approximations these fields, they discretized. Then, different techniques geostatistical inversion condition them on measurement data. Among techniques, Markov chain Monte Carlo (MCMC) stand out, because yield asymptotically unbiased conditional realizations. However, standard Chain methods suffer the curse dimensionality when refining discretization. This means that their efficiency decreases rapidly with an increasing number discretization cells. Several MCMC approaches have been developed such does not depend field. The preconditioned Crank Nicolson (pCN-MCMC) and sequential Gibbs (or block-Gibbs) sampling two examples. paper presents a combination both goal further reduce computational costs. Our algorithm, pCN-MCMC, will tuning-parameters: correlation parameter pCN approach block size approach. original pCN-MCMC algorithm special cases our method. We present automatically finds best tuning-parameter ( ) during burn-in-phase thus choosing possible hybrid between methods. test cases, we achieve speedup factors 1–5.5 over 1–6.5 Gibbs. Furthermore, provide MATLAB implementation method as open-source code.
منابع مشابه
Discretization-invariant Bayesian Inversion and Besov Space Priors
Bayesian solution of an inverse problem for indirect measurement M = AU + E is considered, where U is a function on a domain of R. Here A is a smoothing linear operator and E is Gaussian white noise. The data is a realization mk of the random variable Mk = PkAU + PkE, where Pk is a linear, finite dimensional operator related to measurement device. To allow computerized inversion, the unknown is...
متن کاملEfficient Sampling of Transpositions and Inverted Transpositions for Bayesian MCMC
The evolutionary distance between two organisms can be determined by comparing the order of appearance of orthologous genes in their genomes. Above the numerous parsimony approaches that try to obtain the shortest sequence of rearrangement operations sorting one genome into the other, Bayesian Markov chain Monte Carlo methods have been introduced a few years ago. The computational time for conv...
متن کاملInferring sound changes using Bayesian MCMC
In this paper we analyze dialect phonetic data using Bayesian Monte Carlo Markov Chain inference (MCMC), in recent years one of the most powerful and the most successful methods in molecular phylogeny for inferring the relationships between species. This method enables us to infer the historic relationships between the language varieties, but also to explore historical accounts of the sound cor...
متن کاملBayesian Tomographic Reconstruction Using Riemannian MCMC
This paper describes the use of Monte Carlo sampling for tomographic image reconstruction. We describe an efficient sampling strategy, based on the Riemannian Manifold Markov Chain Monte Carlo algorithm, that exploits the peculiar structure of tomographic data, enabling efficient sampling of the high-dimensional probability densities that arise in tomographic imaging. Experiments with positron ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Water Resources Research
سال: 2021
ISSN: ['0043-1397', '1944-7973']
DOI: https://doi.org/10.1029/2021wr030051